Confluence of Conditional Rewrite Systems
نویسندگان
چکیده
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming. An important issue, in either case, is determining whether a rewrite system has the Church-Rosser, or confluence, property. In this paper, we settle negatively the question whether "joinabihty of critical pairs" is, in general, sufficient for confluence of terminating conditional systems. We review known sufficient conditions for confluence, and also prove two new positive results for systems having critical pairs and arbitrarily big terms in conditions.
منابع مشابه
Confluence of Conditional Term Rewrite Systems via Transformations
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems. Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with ...
متن کاملOn Modularity of Termination and Confluence Properties of Conditional Rewrite Systems
We investigate the modularity behaviour of termination and connuence properties of conditional term rewriting systems. In particular , we show how to obtain suucient conditions for the modularity of weak termination, weak innermost termination, (strong) innermost termination , (strong) termination, connuence and completeness of conditional rewrite systems.
متن کاملConditional Confluence (System Description)
This paper describes the Conditional Confluence tool, a fully automatic confluence checker for first-order conditional term rewrite systems. The tool implements various confluence criteria that have been proposed in the literature. A simple technique is presented to test conditional critical pairs for infeasibility, which makes conditional confluence criteria more useful. Detailed experimental ...
متن کاملLevel-Confluence of Conditional Rewrite Systems with Extra Variables in Right-Hand Sides
Level-confluence is an important property of conditional term rewriting systems that allow extra variables in the rewrite rules because it guarantees the completeness of narrowing for such systems. In this paper we present a syntactic condition ensuring level-confluence for orthogonal, not necessarily terminating, conditional term rewriting systems that have extra variables in the right-hand si...
متن کاملFormalized Confluence of Quasi-Decreasing, Strongly Deterministic Conditional TRSs
We present an Isabelle/HOL formalization of a characterization of confluence for quasi-reductive strongly deterministic conditional term rewrite systems, due to Avenhaus and Loŕıa-Sáenz.
متن کامل